A Probabilistic Algorithm for Computing Hough Transforms
نویسندگان
چکیده
The Hough transform is a common technique in computer vision and pattern recognition for recognizing patterns of points. We describe an efficient probabilistic algorithm for a Monte-Carlo approximation to the Hough transform. Our algorithm requires substantially less computation and storage than the standard Hough transform when applied to patterns that are easily recognized by humans. The probabilistic steps involve randomly choosing small subsets of points that jointly vote for likely patterns.
منابع مشابه
Connective Randomized Hough Transform (crht)
A new branch of Hough Transform algorithms, called probabilistic Hough Transforms, has been actively developed in recent years. One of the rst was a new and eecient probabilistic version of the Hough Transform for curve detection, the Randomized Hough Transform (RHT). The RHT picks n pixels from an edge image by random sampling to solve n parameters of a curve and then accumulates only one cell...
متن کاملDeriving Stopping Rules for the Probabilistic Hough Transform by Sequential Analysis
It is known that Hough Transform computation can be signiicantly accelerated by polling instead of voting. A small part of the data set is selected at random and used as input to the algorithm. The performance of these Proba-bilistic Hough Transforms depends on the poll size. Most Probabilistic Hough algorithms use a xed poll size, which is far from optimal since conservative design requires th...
متن کاملRepresenting Directions for Hough Transforms
Many algorithms in computer vision operate with directions, i. e. with representations of 3D-points by ignoring their distance to the origin. Even though minimal parametrizations of directions may contain singularities, they can enhance convergence in optimization algorithms and are required e. g. for accumulator spaces in Hough transforms. There are numerous possibilities for parameterizing di...
متن کاملAn improved constant-time algorithm for computing the Radon and Hough transforms on a reconfigurable mesh
The Hough transform is an important problem in image processing and computer vision. Recently, an efficient algorithm for computing the Hough transform has been proposed on a reconfigurable array [12]. For a problem with an p N p N image and an n n parameter space, the algorithm runs in a constant time on a threedimensional (3-D) n n N reconfigurable mesh where the data bus is N1=c-bit wide. To...
متن کاملComparisons of Probabilistic and Non-probabilistic Hough Transforms
A new and eecient version of the Hough Transform for curve detection, the Randomized Hough Transform (RHT), has been recently suggested. The RHT selects n pixels from an edge image by random sampling to solve n parameters of a curve and then accumulates only one cell in a parameter space. In this paper, the RHT is related to other recent developments of the Hough Transform by experimental tests...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Algorithms
دوره 12 شماره
صفحات -
تاریخ انتشار 1991